Lattice Sparsification and the Approximate Closest Vector Problem
نویسندگان
چکیده
We give a deterministic algorithm for solving the (1+ε) approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2(1 + 1/ε) time and 2 poly(n) space. Our algorithm builds on the lattice point enumeration techniques of Micciancio and Voulgaris (STOC 2010) and Dadush, Peikert and Vempala (FOCS 2011), and gives an elegant, deterministic alternative to the “AKS Sieve” based algorithms for (1 + ε)-CVP (Ajtai, Kumar, and Sivakumar; STOC 2001 and CCC 2002). Furthermore, assuming the existence of a poly(n)-space and 2 time algorithm for exact CVP in the l2 norm, the space complexity of our algorithm can be reduced to polynomial. Our main technical contribution is a method for “sparsifying” any input lattice while approximately maintaining its metric structure. To this end, we employ the idea of random sublattice restrictions, which was first employed by Khot (FOCS 2003) for the purpose of proving hardness for Shortest Vector Problem (SVP) under lp norms. Georgia Tech. Atlanta, GA, USA. Email: [email protected] Courant Institute for Mathematical Sciences, NY, USA. Email: [email protected]
منابع مشابه
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors
We show that given oracle access to a subroutine which returns approximate closest vectors in a lattice, one may find in polynomial time approximate shortest vectors in a lattice. The level of approximation is maintained; that is, for any function f , the following holds: Suppose that the subroutine, on input a lattice L and a target vector w (not necessarily in the lattice), outputs v ∈ L such...
متن کاملApproximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
We give a polynomial time Turing reduction from the γ √ napproximate closest vector problem on a lattice of dimension n to a γapproximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved γn 3
متن کاملApproximate Algorithms on Lattices with Small Determinant
In this paper, we propose approximate lattice algorithms for solving the shortest vector problem (SVP) and the closest vector problem (CVP) on an n-dimensional Euclidean integral lattice L. Our algorithms run in polynomial time of the dimension and determinant of lattices and improve on the LLL algorithm when the determinant of a lattice is less than 2 2/4. More precisely, our approximate SVP a...
متن کاملSampling Short Lattice Vectors and the Closest Lattice Vector Problem
We present a 2 O(n) time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and computes a (1+)-approximation to CVP. As a consequence, using the SVP algorithm from 1], we obtain a randomized 2 O(1+ ?1)n algorithm to obtain a...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013